On Finite-State Tonology with Autosegmental Representations
نویسنده
چکیده
Building finite-state transducers from written autosegmental grammars of tonal languages involves compiling the rules into a notation provided by the finitestate tools. This work tests a simple, human readable approach to compile and debug autosegmental rules using a simple string encoding for autosegmental representations. The proposal is based on brackets that mark the edges of the tone autosegments. The bracket encoding of the autosegments is compact and directly human readable. The paper also presents a usual finite-state transducer for transforming a concatenated string of lexemes where each lexeme (such as ”babaa|HH”) consists of a segmental substring and a tonal substring into a chronological master string (”b[a]b[aa]”) where the tone autosegments are associated with their segmental spans.
منابع مشابه
One-Level Phonology: Autosegmental Representations and Rules as Finite Automata
When phonological rules are regarded as declarative descriptions, it is possible to construct a model of phonology in which rules and representations are no longer distinguished and such procedural devices as rule-ordering are absent. In this paper we present a finite-state model of phonology in which automata are the descriptions and tapes (or strings) are the objects being described. This pro...
متن کاملThree Equivalent Codes for Autosegmental Representations
A string encoding for a subclass of bipartite graphs enables graph rewriting used in autosegmental descriptions of tone phonology via existing and highly optimized finite-state transducer toolkits (YliJyr 2013). The current work offers a rigorous treatment of this code-theoretic approach, generalizing the methodology to all bipartite graphs having no crossing edges and unordered nodes. We prese...
متن کاملMulti-Tiered Nonlinear Morphology Using Multi-Tape Finite Automata: A Case Study on Syriac and Arabic
This paper presents a computational model for nonlinear morphology with illustrations from Syriac and Arabic. The model is a multitiered one in that it allows for multiple lexical representations corresponding to the multiple tiers of autosegmental phonology. The model consists of three main components: (i) a lexicon, which is made of sublexica, with each sublexicon representing lexical materia...
متن کاملA Concatenation Operation to Derive Autosegmental Graphs
Autosegmental phonology represents words with graph structures. This paper introduces a way of reasoning about autosegmental graphs as strings of concatenated graph primitives. The main result shows that the sets of autosegmental graphs so generated obey two important, putatively universal, constraints in phonological theory provided that the graph primitives also obey these constraints. These ...
متن کاملHow Autosegmental is Phonology?
In this paper I address the following questions: How appropriate/effective are traditional autosegmental representations? What insights do autosegmental representations help us express? Where do autosegmental representations fall short? And finally, what does this all mean for phonology? Such questions are particularly timely, as numerous scholars have abandoned both earlier assumptions of clas...
متن کامل